Perfect 2-colorings of the cubic graphs of order less than or equal to 10

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect $2$-colorings of the Platonic graphs

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

متن کامل

ATANASSOV'S INTUITIONISTIC FUZZY GRADE OF I.P.S. HYPERGROUPS OF ORDER LESS THAN OR EQUAL TO 6

In this paper we determine the sequences of join spaces and Atanassov's intuitionistic fuzzy sets associated with all i.p.s. hypergroups of order less than or equal to 6, focusing on the calculation of their lengths.

متن کامل

atanassov's intuitionistic fuzzy grade of i.p.s. hypergroups of order less than or equal to 6

in this paper we determine the sequences of join spaces and atanassov's intuitionistic fuzzy sets associated with all i.p.s. hypergroups of order less than or equal to 6, focusing on the calculation of their lengths.

متن کامل

The Matching Equivalence Graphs with the Maximum Matching Root Less than or Equal to 2

In the paper, we give a necessary and sufficient condition of matching equivalence of two graphs with the maximum matching root less than or equal to 2.

متن کامل

ON THE NUMBER OF PRIMES LESS THAN OR EQUAL x

(3) Z I"—1 log p = x log x + 0{x). r-ix\-pJ Since [x/^>]= [[#]/£], it is clear that (3) then holds for all real x>0. We propose to show in this note that the order of w(x) =the number of primes less than or equal x (a result originally due to Tschebyschef, cf. [l]) may be derived very quickly from (3) as a consequence of a general theorem which has no particular relationship to prime numbers. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics

سال: 2020

ISSN: 0972-8600,2543-3474

DOI: 10.1016/j.akcej.2018.11.004